Lower Bounds on Parameter Modulation–Estimation Under Bandwidth Constraints

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Geometric Lower Bounds for Distributed Parameter Estimation under Communication Constraints

We consider parameter estimation in distributed networks, where each node in the network observes an independent sample from an underlying distribution and has k bits to communicate its sample to a centralized processor which computes an estimate of a desired parameter of the distribution. We develop lower bounds for the minimax risk of estimating the underlying parameter under squared l2 loss ...

متن کامل

IRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES Lower Bounds on Parameter Modulation–Estimation Under Bandwidth Constraints

We consider the problem of modulating the value of a parameter onto a band-limited signal to be transmitted over a continuous-time, additive white Gaussian noise (AWGN) channel, and estimating this parameter at the receiver. The performance is measured by the mean power-α error (MPαE), which is defined as the worst-case α-th order moment of the absolute estimation error. The optimal exponential...

متن کامل

Bandwidth-Hard Functions: Reductions and Lower Bounds

Memory Hard Functions (MHFs) have been proposed as an answer to the growing inequality between the computational speed of general purpose CPUs and Application Specific Integrated Circuits (ASICs). MHFs have seen widespread applications including password hashing, key stretching and proofs of work. Several metrics have been proposed to quantify the ‘memory hardness’ of a function. Cumulative mem...

متن کامل

Multicast Rate Control under Discrete Bandwidth Constraints

In this paper, we address the rate control problem for layered multicast sessions, with the objective of solving a generalized throughput/fairness objective. Our approach is based on a combination of Lagrangian relaxation and dynamic programming. Unlike previously proposed dual-based approaches, the algorithm presented in this paper scales well as the number of multicast sessions in the network...

متن کامل

Distributed Estimation Under Bandwidth and Energy Constraints

In parameter estimation problems a sequence of observations {x(n)}n=1 is used to estimate a random or deterministic parameter of interest s. Optimal estimation exploits the statistical correlation between x(n) and s that is described either by the joint probability distribution function (pdf) p(x(n), s) when s is assumed random; or by a family of observation pdfs p(x(n); s) parameterized by s w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2017

ISSN: 0018-9448,1557-9654

DOI: 10.1109/tit.2017.2677461